Formalizing Non-Formalism: Breaking the Rules of Automated Game Design

نویسندگان

  • Michael Cook
  • Gillian Smith
چکیده

Automated game design (AGD) is an exciting new frontier for generative software and games research, one which intersects many areas of AI as well as cutting across the many creative domains involved in developing a game. However, there is a trend throughout existing automated game design work to concentrate primarily on the rules that underpin a game – objectives, obstacles, and the notion of challenge. This paper examines this trend in automated game design, and argues that a broader understanding of games is needed. We examine the history of AGD to date, and consider this work in the context of game design theories and definitions. We discuss the term secret box to describe a class of game that does not fall into the purview of existing AGD approaches, and offer a design sketch of an AGD system we are building, ANGELINA 6, to begin to challenge these ideas.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Automated Game Design

Game generation systems perform automated, intelligent design of games (i.e. videogames, boardgames), reasoning about both the abstract rule system of the game and the visual realization of these rules. Although, as an instance of the problem of creative design, game generation shares some common research themes with other creative AI systems such as story and art generators, game generation ex...

متن کامل

Formalizing Defeasible Logic in CAKE

Due to its efficiency, defeasible logic is one of the most interesting non-monotonic formalisms. Unfortunately, the logic has one major limitation: it does not properly deal with cyclic defeasible rules. In this paper, we provide a new variant of defeasible logic, using CAKE method. The resulting formalism is tractable and properly deals with circular defeasible rules.

متن کامل

5 Distributivity breaking and macroscopic quantum games

Examples of games between two partners with mixed strategies, calculated by the use of the probability amplitude as some vector in Hilbert space are given. The games are macroscopic ,no microscopic quantum agent is supposed. The reason for the use of the quantum formalism is in breaking of the distributivity property for the lattice of yes-no questions arising due to the special rules of games....

متن کامل

Distributivity breaking and macroscopic quantum games

Examples of games between two partners with mixed strategies, calculated by the use of the probability amplitude as some vector in Hilbert space are given. The games are macroscopic ,no microscopic quantum agent is supposed. The reason for the use of the quantum formalism is in breaking of the distributivity property for the lattice of yes-no questions arising due to the special rules of games....

متن کامل

Modular Computational Critics for Games

Formal game modeling tools could support the automated analysis of game rules and rapid automated playtesting, but are not widely used. Furthermore, existing game design support tools are often limited to very specific classes of game, require significant programming expertise to use or customize, or are fully-automatic tools with limited affordances for human designers. We therefore propose a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015